TSTP Solution File: SEV450^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV450^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:14 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 61 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 276 ( 69 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 318 ( 34 ~; 55 |; 0 &; 224 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 75 ( 0 ^ 66 !; 4 ?; 75 :)
% ( 5 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/UNION':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_11,type,
sK1: sK0 > $o ).
thf(func_def_13,type,
sK3:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_14,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK5: sK0 ).
thf(f182,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f62,f126,f131,f181]) ).
thf(f181,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f180]) ).
thf(f180,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f179]) ).
thf(f179,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_4 ),
inference(forward_demodulation,[],[f172,f61]) ).
thf(f61,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl2_4
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f172,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f171]) ).
thf(f171,plain,
( ( $false = $true )
| ( ( sK1 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(superposition,[],[f41,f163]) ).
thf(f163,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 )
= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f162]) ).
thf(f162,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 )
= $true )
| ( $false = $true )
| ~ spl2_1 ),
inference(duplicate_literal_removal,[],[f156]) ).
thf(f156,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 )
= $true )
| ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 )
= $true )
| ~ spl2_1 ),
inference(superposition,[],[f48,f65]) ).
thf(f65,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 ) )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true ) ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false = $true )
| ( $false
= ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 ) )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true ) ),
inference(superposition,[],[f39,f40]) ).
thf(f40,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.u9vydJOkBB/Vampire---4.8_18628','thm/sets/IN_') ).
thf(f39,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f35]) ).
thf(f35,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
| ( ( 'const/sets/IN' @ X0 @ X4 @ X3 )
= ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.u9vydJOkBB/Vampire---4.8_18628','thm/sets/IN_UNION_') ).
thf(f48,plain,
( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f46,plain,
( spl2_1
<=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f41,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f131,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f130]) ).
thf(f130,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f127]) ).
thf(f127,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_4 ),
inference(backward_demodulation,[],[f52,f61]) ).
thf(f52,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl2_2
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f126,plain,
( spl2_4
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f123,f55,f59]) ).
thf(f55,plain,
( spl2_3
<=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f123,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f118,plain,
( ( $false = $true )
| ( ( sK1 @ sK5 )
= $false )
| ~ spl2_3 ),
inference(superposition,[],[f116,f40]) ).
thf(f116,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f115]) ).
thf(f115,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ( $false = $true )
| ~ spl2_3 ),
inference(superposition,[],[f57,f96]) ).
thf(f96,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f95]) ).
thf(f95,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false )
| ( $false = $true ) ),
inference(superposition,[],[f41,f37]) ).
thf(f37,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f36]) ).
thf(f36,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f57,plain,
( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $false )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f62,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f44,f59,f55]) ).
thf(f44,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f42,plain,
( ( sK1 @ sK5 )
!= ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 ) ),
inference(negative_extensionality,[],[f15]) ).
thf(f15,plain,
( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 )
!= sK1 ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 )
!= sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ X1 )
!= X1 )
=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 )
!= sK1 ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ X1 )
!= X1 ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ X1 )
= X1 ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X2 @ X2 )
= X2 ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X2: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X2 @ X2 )
= X2 ),
file('/export/starexec/sandbox/tmp/tmp.u9vydJOkBB/Vampire---4.8_18628','thm/sets/UNION_IDEMPOT_') ).
thf(f53,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f43,f50,f46]) ).
thf(f43,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( 'const/sets/UNION' @ sK0 @ sK1 @ sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEV450^1 : TPTP v8.1.2. Released v7.0.0.
% 0.11/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:59:34 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH1_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.u9vydJOkBB/Vampire---4.8_18628
% 0.15/0.38 % (18742)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (18739)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.38 % (18740)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.38 % (18744)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.38 % (18741)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.38 % (18745)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.38 % (18743)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % Exception at run slice level
% 0.15/0.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.15/0.38 % (18742)Instruction limit reached!
% 0.15/0.38 % (18742)------------------------------
% 0.15/0.38 % (18742)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (18742)Termination reason: Unknown
% 0.15/0.38 % (18742)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (18742)Memory used [KB]: 5500
% 0.15/0.38 % (18742)Time elapsed: 0.004 s
% 0.15/0.38 % (18742)Instructions burned: 2 (million)
% 0.15/0.38 % (18742)------------------------------
% 0.15/0.38 % (18742)------------------------------
% 0.15/0.38 % (18746)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.38 % (18740)Instruction limit reached!
% 0.15/0.38 % (18740)------------------------------
% 0.15/0.38 % (18740)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (18740)Termination reason: Unknown
% 0.15/0.38 % (18740)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (18740)Memory used [KB]: 5500
% 0.15/0.38 % (18740)Time elapsed: 0.005 s
% 0.15/0.38 % (18740)Instructions burned: 4 (million)
% 0.15/0.38 % (18740)------------------------------
% 0.15/0.38 % (18740)------------------------------
% 0.15/0.38 % (18744)Refutation not found, incomplete strategy
% 0.15/0.38 % (18744)------------------------------
% 0.15/0.38 % (18744)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (18744)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (18744)Memory used [KB]: 5500
% 0.15/0.38 % (18744)Time elapsed: 0.005 s
% 0.15/0.38 % (18744)Instructions burned: 3 (million)
% 0.15/0.38 % (18744)------------------------------
% 0.15/0.38 % (18744)------------------------------
% 0.15/0.38 % (18746)Instruction limit reached!
% 0.15/0.38 % (18746)------------------------------
% 0.15/0.38 % (18746)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (18746)Termination reason: Unknown
% 0.15/0.38 % (18746)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (18746)Memory used [KB]: 5500
% 0.15/0.38 % (18746)Time elapsed: 0.004 s
% 0.15/0.38 % (18746)Instructions burned: 3 (million)
% 0.15/0.38 % (18746)------------------------------
% 0.15/0.38 % (18746)------------------------------
% 0.15/0.39 % (18745)Instruction limit reached!
% 0.15/0.39 % (18745)------------------------------
% 0.15/0.39 % (18745)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (18745)Termination reason: Unknown
% 0.15/0.39 % (18745)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (18745)Memory used [KB]: 5628
% 0.15/0.39 % (18745)Time elapsed: 0.015 s
% 0.15/0.39 % (18745)Instructions burned: 18 (million)
% 0.15/0.39 % (18745)------------------------------
% 0.15/0.39 % (18745)------------------------------
% 0.15/0.39 % (18741)First to succeed.
% 0.15/0.39 % (18747)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.15/0.39 % (18748)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.15/0.39 % Exception at run slice level
% 0.15/0.39 User error: % (18741)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for Vampire---4
% 0.15/0.40 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.40 % (18741)------------------------------
% 0.15/0.40 % (18741)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (18741)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (18741)Memory used [KB]: 5500
% 0.15/0.40 % (18741)Time elapsed: 0.018 s
% 0.15/0.40 % (18741)Instructions burned: 21 (million)
% 0.15/0.40 % (18741)------------------------------
% 0.15/0.40 % (18741)------------------------------
% 0.15/0.40 % (18738)Success in time 0.016 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------